Optimality conditions for nonconvex problems over nearly convex feasible sets
نویسندگان
چکیده
منابع مشابه
Optimality Conditions for Nonconvex Multistate Control Problems in the Coefficients
The purpose of this paper is to attain some optimality conditions for the identification of a diffusion matrix (material) under several restrictions. Assuming that the set of such diffusion matrices is closed for the H-convergence, we give a method to obtain admissible directions which applies to a not-necessarily convex control set. Our results permit obtaining the diffusion matrix from the st...
متن کاملStrong formulations for convex functions over nonconvex sets
Preliminaries. Several important classes of optimization problems include nonlinearities in the objective or constraints. Often this results in nonconvexities and a current research thrust addresses the computation of global bounds and exact solution techniques for such problems. The field is not new; one of the earliest results is the characterization of the convex hull of a box-constrained bi...
متن کاملCutting-Planes for Optimization of Convex Functions over Nonconvex Sets
We derive linear inequality characterizations for sets of the form conv{(x, q) ∈ R×R : q ≥ Q(x), x ∈ R − int(P )} where Q is convex and differentiable and P ⊂ R. We show that in several cases our characterization leads to polynomial-time separation algorithms that operate in the original space of variables, in particular when Q is a positive-definite quadratic and P is a polyhedron or an ellips...
متن کاملε - optimality conditions for composed convex optimization problems
The aim of the present paper is to provide a formula for the ε subdifferential of f +g ◦h different from the ones which can be found in the existent literature. Further we equivalently characterize this formula by using a so-called closedness type regularity condition expressed by means of the epigraphs of the conjugates of the functions involved. Even more, using the ε subdifferential formula ...
متن کاملOn -optimality Conditions for Convex Set-valued Optimization Problems
In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arabian Journal of Mathematics
سال: 2021
ISSN: 2193-5343,2193-5351
DOI: 10.1007/s40065-021-00315-3